Message Broadcast Using Random Relaying of Partitioned MDS Codeword Blocks over Random Error Channels
نویسنده
چکیده
Broadcast of a message to nodes in a network is one of elementary but inevitable techniques in wireless ad-hoc and sensor networks. In this paper, we apply the protocol, which the authors proposed for cooperative multi-hop relay networks, to message broadcast over random error channels. Performance is evaluated in terms of the delivery ratio by means of computer simulations. The proposed protocol utilizes an MDS code and a relay node randomly transfers one of partitioned codeword blocks rather than the original message. We suppose a network of square-lattice topology as a preliminary example. Numerical results show that the significant performance improvement can be achieved, in particular, if a relay node can make use of previously received erroneous codeword blocks in the decoding procedure of the MDS code.
منابع مشابه
Performance of Random Relaying of MDS Codeword Blocks in Cooperative Multi - Hop Networks over Random Error Channels
Abstract—We propose random relaying of MDS codeword blocks in cooperative multi-hop networks and evaluate its performance over random error channels by means of an absorbing Markov chain. The proposed scheme can apply to cooperative multi-hop networks with the arbitrary number of relay nodes at each hop stage and require no feedback channels between nodes. In the proposed scheme, a message bloc...
متن کاملLocally Decodable Codes
Locally decodable codes are a class of error-correcting codes. Errorcorrecting codes help ensure reliable transmission of information over noisy channels. Such codes allow one to add redundancy, or bit strings, to messages, encoding them into longer bit strings, called codewords, in a way that the message can still be recovered even if a certain fraction of the codeword bits are corrupted. In t...
متن کاملRandom coding theorem for broadcast channels with degraded components
Absfroct-This paper generalizes Cover’s results on broadcast channels with two binary symmetr ic channels (BSC) to the class of degraded channels with N components. A random code, and its associated decoding scheme, is shown to have expected probability of error going to zero for all components simultaneously as the codeword length goes to infinity, if the point representing the rates to the va...
متن کاملMDS codes on the erasure-erasure wiretap channel
This paper considers the problem of perfectly secure communication on a modified version of Wyner’s wiretap channel II where both the main and wiretapper’s channels have some erasures. A secret message is to be encoded into n channel symbols and transmitted. The main channel is such that the legitimate receiver receives the transmitted codeword with exactly n− ν erasures, where the positions of...
متن کاملExplicit Capacity-achieving Codes for Worst-Case Additive Errors
For every p ∈ (0, 1/2), we give an explicit construction of binary codes of rate approaching “capacity” 1−H(p) that enable reliable communication in the presence of worst-case additive errors, caused by a channel oblivious to the codeword (but not necessarily the message). Formally, we give an efficient “stochastic” encoding E(·, ·) of messages combined with a small number of auxiliary random b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013